package acwing._2LanQiao._5BinaryIndexedTree_SegmentTree;
/**
 * @Project : ProgrammingExercises
 * @Package : ACWing._2LanQiao._5BinaryIndexedTree_SegmentTree
 * @File : segmentTree.java
 * @Author : WangRuoyu
 * @Date : 2023/3/17 11:05
 */

class segmentTreeSum {
    int l;
    int r;
    int sum;

    public segmentTreeSum() {
        l = 0;
        r = 0;
        sum = 0;
    }

    public segmentTreeSum(int l, int r, int sum) {
        this.l = l;
        this.r = r;
        this.sum = sum;
    }
}

class segmentTreeMax {
    int l;
    int r;
    long max;

    public segmentTreeMax() {
        l = 0;
        r = 0;
        max = 0;
    }

    public segmentTreeMax(int l, int r, long max) {
        this.l = l;
        this.r = r;
        this.max = max;
    }
}
